Extensive operators in partition lattices for image sequence analysis

This paper deals with the class of extensive operators in the lattice of partitions These operators are merging techniques They can be used as ltering tools or as segmentation algorithms In the rst case they are known as connected operators and in the second case they are region growing techniques This paper discusses the basic elements that have to be de ned to create a merging algorithm merging order merging criterion and region model This analysis highlights the similarity and di erences between a ltering tool such as a connected operator and a segmentation algorithm Taking bene t from the ltering and segmentation viewpoints we propose a general merging algorithm that can be used to create new connected operators in particular self dual operators and e cient segmentation algorithms robust criteria and e cient implementation